Algorithm of Acyclic Dominating Set Problem on Bipartite Permutation Graphs 二部置换图的无圈控制集算法
The algorithm is that, a directed acyclic graph based on statistical dictionary is constructed by the improved omni-segmentation algorithm, and then a result set is obtained by statistic-based screening algorithm, finally, the best segmentation path is obtained after unknown word recognition. 该方法通过构造出基于统计词典的有向无环词图,利用基于统计的筛选算法从中选出一个粗分结果集,经过未登录词识别后得出最佳的分词路径。